Inexact Simplified Newton Iterations for Implicit Runge-Kutta Methods

نویسنده

  • Laurent O. Jay
چکیده

We consider possibly stiff and implicit systems of ordinary differential equations (ODEs). The major difficulty and computational bottleneck in the implementation of fully implicit Runge–Kutta (IRK) methods resides in the numerical solution of the resulting systems of nonlinear equations. To solve those systems we show that the use of inexact simplified Newton methods is efficient. Linear systems of the simplified Newton method are solved approximately with a preconditioned linear iterative method. Sufficient conditions ensuring local convergence of the inexact simplified Newton method for general nonlinear equations are given. The preconditioner that we use is based on the W-transformation of the RK coefficients and on the block-LU decomposition of the simplified Jacobian after W-transformation. A new code based on those techniques, SPARK3, is shown to be effective on two problems; the first one is a linear convection-diffusion problem and the second one a reaction-diffusion problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Parallelizable Preconditioner for the Iterative Solution of Implicit Runge-kutta Type Methods

The main di culty in the implementation of most standard implicit Runge-Kutta (IRK) methods applied to (sti ) ordinary di erential equations (ODE's) is to e ciently solve the nonlinear system of equations. In this article we propose the use of a preconditioner whose decomposition cost for a parallel implementation is equivalent to the cost for the implicit Euler method. The preconditioner is ba...

متن کامل

Triangularly Implicit Iteration Methods for ODE-IVP Solvers

It often happens that iteration processes used for solving the implicit relations arising in ODE-IVP methods only start to converge rapidly after a certain number of iterations. Fast convergence right from the beginning is particularly important if we want to use so-called step-parallel iteration in which the iteration method is concurrently applied at a number of step points. In this paper, we...

متن کامل

A method for constructing generalized

Sugiura, H. and T. Torii, A method for constructing generalized Runge-Kutta methods, Journal of Computational and Applied Mathematics 38 (1991) 399-410. In the implementation of an implicit Runge-Kutta formula, we need to solve systems of nonlinear equations. In this paper, we analyze the Newton iteration process and a modified Newton iteration process for solving these equations. Then we propo...

متن کامل

Iterative Solution of Nonlinear Equations for Spark Methods Applied to Daes

We consider a broad class of systems of implicit differential-algebraic equations (DAEs) including the equations of mechanical systems with holonomic and nonholonomic constraints. We approximate numerically the solution to these DAEs by applying a class of super partitioned additive Runge-Kutta (SPARK) methods. Several properties of the SPARK coefficients, satisfied by the combination of Lobatt...

متن کامل

Diagonally implicit Runge-Kutta methods for 3D shallow water applications

We construct A-stable and L-stable diagonally implicit Runge-Kutta methods of which the diagonal vector in the Butcher matrix has a minimal maximum norm. If the implicit Runge-Kutta relations are iteratively solved by means of the approximately factorized Newton process, then such iterated Runge-Kutta methods are suitable methods for integrating shallow water problems in the sense that the stab...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Numerical Analysis

دوره 38  شماره 

صفحات  -

تاریخ انتشار 2000